Everything about Monster Group totally explained
In the
mathematical field of
group theory, the
Monster group M or
F1 (also known as the Fischer-Griess Monster, or the Friendly Giant) is a
group of finite
order
» 2
46 · 3
20 · 5
9 · 7
6 · 11
2 · 13
3 · 17 · 19 · 23 · 29 · 31 · 41 · 47 · 59 · 71
= 808017424794512875886459904961710757005754368000000000
» ≈ 8 · 10
53.
It is a
simple group, meaning it doesn't have any
normal subgroups except for the subgroup consisting only of the identity element, and
M itself.
The finite simple groups have been completely classified (the
classification of finite simple groups). The
list of finite simple groups consists of 18
countably infinite families, plus 26
sporadic groups that don't follow such a systematic pattern. The Monster group is the largest of these sporadic groups and contains all but six of the other sporadic groups as
subquotients. These six exceptions are known as
pariahs, and the others as the
happy family.
Existence and uniqueness
The Monster was predicted by
Bernd Fischer and
Robert Griess in 1973, as a simple group containing, as subquotients, the
Fischer groups and some other sporadic simple groups. This group couldn't be precisely defined at first, but over the decade it was found possible to estimate the order of M and deduce other properties. Griess first constructed M in
1980 as the
automorphism group of the
Griess algebra, a 196884-dimensional commutative nonassociative algebra.
John Conway subsequently simplified this construction.
Griess's and Conway's constructions show that the Monster exists.
John G. Thompson showed that its uniqueness (as a simple group of the given order) would follow from the existence of a 196883-dimensional faithful representation. A proof of the existence of such a representation was announced in 1982 by
Simon P. Norton, but the details have not yet been published. The first published proof of the uniqueness of M was completed by Griess, Meierfrankenfeld, and Segev in 1990.
The
character table of the Monster, a 194-by-194 array, was calculated in 1979, before the Monster was proven either to exist or be unique. The calculation is based on the assumption that the minimal degree of a faithful complex representation is 196883, product of the 3 largest prime divisors of |M|.
Moonshine
The Monster group prominently features in the
Monstrous moonshine conjecture which relates discrete and non-discrete mathematics and was proven by
Richard Borcherds in 1992.
In this setting, the Monster group is visible as the automorphism group of the
Monster module, a
vertex operator algebra, an infinite dimensional algebra containing the Griess algebra, and acts on the
Monster Lie algebra, a
generalized Kac-Moody algebra.
A computer construction
Robert A. Wilson has found explicitly (with the aid of a computer) two 196882 by 196882 matrices (with elements in the
field of order 2) which together generate the Monster group. However, performing calculations with these matrices is prohibitively expensive in terms of time and storage space. Wilson with collaborators has found a method of performing calculations with the Monster that's considerably faster.
Let
V be a 196882 dimensional vector space over the field with 2 elements. A large subgroup
H (preferably a maximal subgroup) of the Monster is selected in which it's easy to perform calculations. The subgroup
H chosen is 3
1+12.2.Suz.2, where Suz is the
Suzuki group. Elements of the Monster are stored as words in the elements of
H and an extra generator
T. It is reasonably quick to calculate the action of one of these words on a vector in
V. Using this action, it's possible to perform calculations (such as the order of an element of the Monster). Wilson has exhibited vectors
u and
v whose joint stabilizer is the trivial group. Thus (for example) one can calculate the order of an element
g of the Monster by finding the smallest
i > 0 such that
giu =
u and
giv =
v.
This and similar constructions (in different
characteristics) have been used to prove some interesting properties of the Monster (for example, to find some of its non-local maximal subgroups).
Subgroup structure
The Monster has at least 43 conjugacy classes of maximal subgroups. Non-abelian simple groups of some 60 isomorphism types are found as subgroups or as quotients of subgroups. The largest
alternating group represented is A
12.
The Monster contains many but not all of the 26
sporadic groups as
subgroups. This diagram, based on one in the book
Symmetry and the Monster, shows how they fit together. The lines signify inclusion, as a subquotient, of the lower group by the upper one. The circled symbols denote groups not involved in larger sporadic groups. For the sake of clarity redundant inclusions are not shown.
Further Information
Get more info on 'Monster Group'.
|
External Link Exchanges
Do you know how hard it is to get a link from a large encyclopaedia? Well we're different and will prove it. To get a link from us just add the following HTML to your site on a relevant page:
<a href="http://monster_group.totallyexplained.com">Monster group Totally Explained</a>
Then simply click through this link from your web page. Our crawlers will verify your link, extract the title of your web page and instantly add a link back to it. If you like you can remove the words Totally Explained and embed the link in article text.
As long as your link remains in place, we'll keep our link to you right here. Please play fair - our crawlers are watching. Your site must be closely related to this one's topic. Any kind of spamming, dubious practises or removing the link will result in your link from us being dropped and, potentially, your whole site being banned. |
